Multigrid Preconditioners for the Discontinuous Galerkin Spectral Element Method : Construction and Analysis

Discontinuous Galerkin (DG) methods offer a great potential for simulations of turbulent and wall bounded flows with complex geometries since these high-order schemes offer a great potential in handling eddies. Recently, space-time DG methods have become more popular. These discretizations result in implicit schemes of high order in both spatial and temporal directions. In particular, we consider a specific DG variant, the DG Spectral Element Method (DG-SEM), which is suitable to construct entropy stable solvers for conservation laws. Since the size of the corresponding nonlinear systems is dependent on the order of the method in all dimensions, the problem arises to efficiently solve these huge nonlinear systems with regards to CPU time as well as memory consumption.Currently, there is a lack of good solvers for three-dimensional DG applications, which is one of the major obstacles why these high order methods are not used in e.g. industry. We suggest to use Jacobian-free Newton- Krylov (JFNK) solvers, which are advantageous in memory minimization. In order to improve the convergence speed of these solvers, an efficient preconditioner needs to be constructed for the Krylov sub-solver. However, if the preconditioner requires the storage of the DG system Jacobian, the favorable memory consumption of the JFNK approach is obsolete.We therefore present a multigrid based preconditioner for the Krylov sub-method which retains the low mem- ory consumption, i.e. a Jacobian-free preconditioner. To achieve this, we make use of an auxiliary first order finite volume replacement operator. With this idea, the original DG mesh is refined but can still be implemented algebraically. As smoother, we consider the pseudo time iteration W3 with a symmetric Gauss-Seidel type approx- imation of the Jacobian. Numerical results are presented demonstrating the potential of the new approach.In order to analyze multigrid preconditioners, a common tool is the Local Fourier Analysis (LFA). For a space- time model problem we present this analysis and its benefits for calculating smoothing and two-grid convergence factors, which give more insight into the efficiency of the multigrid method

Efficient Solvers for Space-Time Discontinuous Galerkin Spectral Element Methods

In this thesis we study efficient solvers for space-time discontinuous Galerkin spectral element methods (DG-SEM). These discretizations result in fully implicit schemes of variable order in both spatial and temporal directions. The popularity of space-time DG methods has increased in recent years and entropy stable space-time DG-SEM have been constructed for conservation laws, making them interesting for these applications. The size of the nonlinear system resulting from differential equations discretized with space-time DG-SEM is dependent on the order of the method, and the corresponding Jacobian is of block form with dense blocks. Thus, the problem arises to efficiently solve these huge nonlinear systems with regards to CPU time as well as memory consumption. The lack of good solvers for three-dimensional DG applications has been identified as one of the major obstacles before high order methods can be adapted for industrial applications.It has been proven that DG-SEM in time and Lobatto IIIC Runge-Kutta methods are equivalent, in that both methods lead to the same discrete solution. This allows to implement space-time DG-SEM in two ways: Either as a full space-time system or by decoupling the temporal elements and using implicit time-stepping with Lobatto IIIC methods. We compare theoretical properties and discuss practical aspects of the respective implementations.When considering the full space-time system, multigrid can be used as solver. We analyze this solver with the local Fourier analysis, which gives more insight into the efficiency of the space-time multigrid method. The other option is to decouple the temporal elements and use implicit Runge-Kutta time-stepping methods. We suggest to use Jacobian-free Newton-Krylov (JFNK) solvers since they are advantageous memory-wise. An efficient preconditioner for the Krylov sub-solver is needed to improve the convergence speed. However, we want to avoid constructing or storing the Jacobian, otherwise the favorable memory consumption of the JFNK approach would be obsolete. We present a preconditioner based on an auxiliary first order finite volume replacement operator. Based on the replacement operator we construct an agglomeration multigrid preconditioner with efficient smoothers using pseudo time integrators. Then only the Jacobian of the replacement operator needs to be constructed and the DG method is still Jacobian-free. Numerical experiments for hyperbolic test problems as the advection, advection-diffusion and Euler equations in several dimensions demonstrate the potential of the new approach

Theoretical and Practical Aspects of Space-Time DG-SEM Implementations

We discuss two approaches for the formulation and implementation of space-time discontinuous Galerkin spectral element methods (DG-SEM). In one, time is treated as an additional coordinate direction and a Galerkin procedure is applied to the entire problem. In the other, the method of lines is used with DG-SEM in space and the fully implicit Runge-Kutta method Lobatto IIIC in time. The two approaches are mathematically equivalent in the sense that they lead to the same discrete solution. However, in practice they differ in several important respects, including the terminology used to describe them, the structure of the resulting software, and the interaction with nonlinear solvers. Challenges and merits of the two approaches are discussed with the goal of providing the practitioner with sufficient consideration to choose which path to follow. Additionally, implementations of the two methods are provided as a starting point for further development. Numerical experiments validate the theoretical accuracy of these codes and demonstrate their utility, even for 4D problems.Comment: updated 3D experiments, fixed typo

Evaluation of a Gradient Free and a Gradient Based Optimization Algorithm for Industrial Beverage Pasteurisation Described by Different Modeling Variants

Inspired by Krones Group in Holte/Copenhagen, the intention of this thesis is to simulate and optimize pasteurisation processes. Based on different modes of heat transfer, a mathematical model to describe the thermal processes in the product is developed. The main goal of the thesis is to optimize the thermal treatment of the product. Both the derivative-free COBYLA and the gradient-based MMA optimization algorithm are described and evaluated. The optimal results obtained with the NLopt library in Python are compared and different modeling variants of the optimization problem are developed with regard to their meaningfulness and their numerical behaviour.Pasteurisation is a method used in the food production industry to extend the shelf life of products, mostly beverages. This is achieved by heating the product to a product-specific lethal temperature to inactivate particular micro-organisms. A Pasteurisation Unit (PU) is defined as one minute of thermal treatment at 60C. Canned beverages are pasteurised by transporting them on a conveyor belt through a tunnel pasteur, where spray water in different temperatures gently heates, pasteurises and cooles the product

Finite volume based multigrid preconditioners for discontinuous Galerkin methods

Our aim is to construct efficient preconditioners for high order discontinuous Galerkin (DG) methods. We consider the DG spectral element method with Gauss‐Lobatto‐Legendre nodes (DGSEM‐GL) for the 1D linear advection equation. It has been shown in [4] that DGSEM‐GL has the summation‐by‐parts (SBP) property and an equivalent finite volume (FV) discretization is presented in [3]. Thus we present a multigrid (MG) preconditioner based on a simplified FV discretization

Finite volume based multigrid preconditioners for discontinuous Galerkin methods

Our aim is to construct efficient preconditioners for high order discontinuous Galerkin (DG) methods. We consider the DG spectral element method with Gauss‐Lobatto‐Legendre nodes (DGSEM‐GL) for the 1D linear advection equation. It has been shown in [4] that DGSEM‐GL has the summation‐by‐parts (SBP) property and an equivalent finite volume (FV) discretization is presented in [3]. Thus we present a multigrid (MG) preconditioner based on a simplified FV discretization